Recursive and non-recursive traversal of three degree tree

by

You’re incorrectly printing the node’s value twice.

You don’t need to check node->mid, as this is checked inside inorder(node->mid);.

inorder(node)
{
  if (node)
  {
    inorder(node->left);
    print("%d ", node->value);
    inorder(node->mid);
    inorder(node->right);
  }
}

More Related Contents:

  1. Does C have any tools for doing string addition?
  2. How to reverse a singly linked list using only two pointers?
  3. C – How to implement Set data structure?
  4. Merging two sorted linked lists
  5. Find the Biggest Number in C, BUT with characters
  6. Pattern Programmings
  7. the problem is from a algorithm problem I do recently,but I can't gain the right answer [duplicate]
  8. Finding target sum of two numbers in array
  9. How to get the maximum number after erasing n digits from the number [closed]
  10. hash function for string
  11. Algorithm: efficient way to remove duplicate integers from an array
  12. Why does the C++ STL not provide any “tree” containers?
  13. Building a logarithm function in C without using float type
  14. How can I simplify this working Binary Search code in C?
  15. Are there any open source C libraries with common data structures? [closed]
  16. What is the difference between tree depth and height?
  17. what is the difference between set and unordered_set in C++?
  18. How to find largest triangle in convex hull aside from brute force search
  19. Correctness of Sakamoto’s algorithm to find the day of week
  20. Why prefer start + (end – start) / 2 over (start + end) / 2 when calculating the middle of an array?
  21. Rolling median in C – Turlach implementation
  22. Implementing a HashMap in C [closed]
  23. Rolling median algorithm in C
  24. Easiest way of using min priority queue with key update in C++
  25. Floating point linear interpolation
  26. Finding the intersecting node from two intersecting linked lists
  27. a working non-recursive floodfill algorithm written in C?
  28. Order Statistic Tree in C++
  29. Algorithm to pick values from array that sum closest to a target value?
  30. Avoid Overflow when Calculating π by Evaluating a Series Using 16-bit Arithmetic?

Leave a Comment