/Tree-Data-Structure

A Tree is a widely used abstract data type that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes. A Tree data structure can be defined recursively as a collection of nodes, where each node is a data structure consisting of a value and a list of references to nodes. The start of the tree is the "root node" and the reference nodes are the "children". No reference is duplicated and none points to the root.

Primary LanguageC++

Tree-Data-Structure

Installation

You only need MinGW in your system. If you do not have MinGW you can download it from there. Download according to your system specification.

Getting Started

  • Once you download MinGW install it.
  • Then go to this location(C:\MinGW\bin).
  • Copy that path and paste it to your user/system environment variables where ever you want.
  • If everything is fine, run the following command on your CMD and Terminal:
g++

These commands will show only a fatal error. If these commands do not show a fatal error or some other kind of error, so please make sure you have done all the above steps correctly.

  • If you are done all the steps correctly, you will not face any difficulty at all.
  • Then download the code and run it in your favorite editor.
  • Open your code editor terminal, if your code editor has no terminal so open CMD and locate to that folder which has the files of C++ programs. Then run the following command:
g++ filename
  • This command will compile your code and in your code folder, one file as a.exe was made.
  • Then type 'a' in your terminal and hit the tab button. Your program runs successfully.

Documentation

For more information, Please refer to the C++ docs.
Click here to know more about Binary Tree.
Click here to know more about Binary Search Tree.