👨‍💻
Cracking-Interview
CtrlK
  • Data Structures and Algorithms
  • Arrays
  • Linked List
  • Strings
  • Binary Tree
    • Terminology and Formula
    • N-ary Tree
    • Tree Traversals
      • 1.In-order Traversal
      • 2.Pre-order Traversal
      • 3.Post-order Traversal
      • 4.Level-order Traversal
      • 5.Vertical Order Traversal
      • 6. Binary Tree Level Order Traversal II
    • Problems Related to Binary Trees
  • Stack and Queue
  • Hash Table
  • Binary Search
  • Binary Search Tree
  • Bit manipulation
  • Graph
  • Disjoint Sets(Union-Find)
  • Heap and Priority Queue
  • Trie
  • Dynamic Programming
  • Greedy Algorithms
  • Backtracking
  • Sub Array and Sliding Window Problems
  • Design
  • Maths
  • Sorting-Algorithms
    • Merge Sort
    • Quick Sort
    • Heap Sort
    • Selection Sort
    • Bubble Sort
    • Insertion Sort
  • Expected Interview MCQ and Questions c++
  • Concepts in C++
  • System Design Questions
  • 💾DBMS
    • Introduction
    • RBMS
    • JOINS
    • SQL
  • 🖥️OS
    • OS and Its Types
    • Process Concept and Threads
    • Process Synchronization
    • Deadlock in Operating System
    • Memory Management
    • Imp Questions of OS for Interviews
  • 🚙OOPS
    • Introduction and Definitions
  • 📨COMPUTER-NETWORKS
    • OSI | TCP IP Model
    • Topology
    • Network Devices
    • IP Address
Powered by GitBook
On this page

Was this helpful?

  1. Binary Tree

Tree Traversals

1.In-order Traversal2.Pre-order Traversal3.Post-order Traversal4.Level-order Traversal5.Vertical Order Traversal6. Binary Tree Level Order Traversal II

Previous3. N-ary Tree Level Order TraversalNext1.In-order Traversal

Last updated 4 years ago

Was this helpful?