AlgoFlow — Algorithms, Visualized

Data Structures/Binary Tree Traversals

treehierarchicaltraversal

Press play to start

1void insert(Node** root, int val) {
  if (!*root) { *root = newNode(val); return; }
  Node* curr = *root;
  while (curr) {
      if (val < curr->val) {
          if (!curr->left) { curr->left = newNode(val); return; }
          curr = curr->left;
      } else {
          if (!curr->right) { curr->right = newNode(val); return; }
          curr = curr->right;
      }
  }
13}

Step 1/0

Practice

LeetCode·#94 Binary Tree Inorder TraversalEasy HackerRank·Tree: Inorder TraversalEasy NeetCode·Binary Tree Inorder TraversalEasy

Operation	Best	Average	Worst
insert	O(log n)	O(log n)	O(n)
search	O(log n)	O(log n)	O(n)
traverse	O(n)	O(n)	O(n)

SpaceO(h)