About this document
Binary Trees and Traversal in C++ by Sandeep Kumar is a document available to read on EtoBox.
This document discusses binary trees and binary search trees. It begins by defining binary trees and their basic components. It then covers various binary tree traversal algorithms including inorder, preorder and postorder traversals. Next, it discusses binary search trees and their operations such as insertion, deletion and searching. The document also explores non-recursive traversal algorithms and covers AVL trees, including their rotations needed during insertion and deletion to maintain balance.
- Author
- Sandeep Kumar
- Language
- EN