• Home
  • C++
  • STL
  • C++11
  • Multithreading
  • Python
  • Design Patterns
  • Datastructure
  • About Us

thisPointer.com

  • C++11 Tutorials
  • STL
  • Python
  • C++ Tutorials
  • Multithreading
  • Boost Library
    • Boost Date Time Library
    • Boost String Algorithms Library
  • Design Patterns
  • java
  • GDB
  • Datastructure
    • Binary Search Tree
    • Binary Tree
    • Linked List
  • Subscribe
You are here: Home » Binary Tree

Finding paths in a Binary Tree

Varun August 19, 2014 Finding paths in a Binary Tree2015-09-25T00:14:19+00:00 Binary Tree 1 Comment
Many times we need to search for some specific paths in a binary tree from top to bottom. Lets design a code to find out all paths in a binary…
Continue Reading »

Binary Tree Traversal with Strategy design pattern and open-closed principle

Varun July 31, 2014 Binary Tree Traversal with Strategy design pattern and open-closed principle2015-09-25T00:14:20+00:00 Binary Tree 3 Comments
Many time we need to perform certain tasks on Binary trees. These tasks can be, Counting nodes that satisfy some criteria. Displaying all nodes in particular pattern like, printing expression…
Continue Reading »

Advertisements

Advertisements

Subscribe For latest Tutorials

* indicates required

Advertisements

Advertisements

Search

Like us on Facebook

Java – HashSet

  • What is Hashing and Hash Table?
  • Create and add elements in a HashSet
  • Iterate over a HashSet
  • Search for an element in HashSet
  • Merge two HashSets
  • Initializing HashSet from an Array
  • Convert a HashSet into an Array
  • Merge an Array in a HashSet

Java Interview Questions

  • Method Overriding Tutorial
  • Overriding with Different Return Type
  • Calling Base class’s overridden method
  • Preventing Method Overriding
  • Need of preventing Method Overriding

Subscribe

Subscribe For latest Tutorials

* indicates required

Design Patterns

  • Behavioral Design Patterns
    • Observer Design Pattern
    • State Design Pattern
    • Strategy Design Pattern
  • Structural Design Patterns
    • Composite Design Pattern
    • Flyweight Design Pattern
  • Creational Design Patterns
    • Factory Method Design Pattern

C++11 – Utilities

  • std::bind
  • auto specifier
  • Variadic Templates

C++11 – Unordered Set

  • 1.) unordered_set Basic Example
  • 2.) Initializing an unordered_set
  • 3.) Inserting elements in an unordered_set
  • 4.) Searching an element in unordered_set
  • 5.) unordered_set – Custom Hasher & Comparator
  • 6.) Unordered_set & User defined classes

C++11 – UnorderedMap

  • Basic Usage Detail and Example
  • Initializing an unordered_map
  • Searching in unordered_map
  • Insert elements in unordered_map
  • Erasing an element
  • Erase elements while iterating
  • std::map vs std::unordered_map

C++11 Smart Pointers

  • shared_ptr<> Tutorial and Examples
  • shared_ptr and Custom Deletor
  • shared_ptr vs raw pointer
  • Create shared_ptr objects carefully
  • weak_ptr Tutorial | shared_ptr and Cyclic References
  • unique_ptr<> Tutorial and Examples

C++11 Multithreading

  • Part 1: Three Ways to Create Threads
  • Part 2: Joining and Detaching Threads
  • Part 3: Passing Arguments to Threads
  • Part 4 : Sharing Data & Race Conditions
  • Part 5 : Fixing Race Conditions using mutex
  • Part 6 : Need of Event Handling
  • Part 7: Condition Variables
  • Part 8: std::future and std::promise
  • Part 9: std::async Tutorial & Example
  • Part 10: std::packaged_task<> Tutorial

C++11 Rvalue References

  • lvalue vs rvalue
  • Is rvalue immutable in C++?
  • What is rvalue reference in C++11
  • Move Contsructor

Pointers

  • Pointer vs Refrence
  • Allocating 2D Array Dynamically

Callbacks in C++

  • Function Pointers
  • Function Objects & Functors

C++ Strings

  • Find and Replace all occurrences of a string
  • Find all occurrences of a sub string
  • Case Insensitive string::find
  • Convert First Letter of each word to Upper Case
  • Converting a String to Upper & Lower Case
  • Trim strings in C++
  • C++ : How to split a string using String and character as Delimiter?
  • startsWith() Implementation
  • endsWith() Implementation
  • Remove Sub Strings from String

C++ Memory Manangement

  • Memory Leaks
  • new and delete operator
  • delete vs []delete
  • Out Of Memory Errors
  • Overload new & delete
  • Restrict Dynamic Deletion
  • Placement new operator
  • Delete ‘this’ pointer

Polymorphism

  • Virtual Functions
  • vTable and vPointer

STL – Vector

  • 1.) What’s std::vector and why to use it?
  • 2.) Different ways to initialize a vector
  • 3.) How does std::vector works internally
  • 4.) User Defined Objects & std::vector
  • 5.) How to use vector efficiently in C++?
  • 6.) std::vector and Iterator Invalidation
  • 7.) Remove repeated elements from a vector
  • 8.) Fill a vector with random numbers
  • 9.) Hidden cost of std::vector
  • 10.) Adding elements in Vector

STL – Deque

  • 1.) What is std::deque and how deque works internally.
  • 2.) deque vs vector : What to choose ?

STL – List

  • 1.) std::list Internals & Usage Details
  • 2.) List vs Vector
  • 3.) Different ways to Initialize a list
  • 4.) Erase elements using iterators
  • 5.) Remove elements while Iterating
  • 6.) Remove elements based on External Criterion
  • 7.) Get element by index in List
  • 8.) Searching an element in std::list
  • 9.) Different Ways to iterate over a List
  • 10.) Sorting a List & custom Comparator

STL – Set

  • 1.) C++ Set basic example and Tutorial
  • 2.) Using std::set with user defined classes
  • 3.) std::set and external Sorting criteria | Comparator
  • 4.) Access Element by index in Set
  • 5.) How to insert elements in Set
  • 6.) How to iterate over a Set
  • 7.) Removing an element from Set
  • 8.) Erase elements while Iterating & Generic erase_if()

STL – Map

  • 1.) std::map Usage Detail with examples
  • 2.) std::map and Comparator
  • 3.) std::map & User defined class objects as keys
  • 4.) Set vs Map
  • 5.) How to Iterate over a map in C++
  • 6.) Map Insert Example
  • 7.) Iterate a map in reverse order
  • 8.) Check if a key exists in a Map
  • 9.) Search by value in a Map
  • 10.) Erase by Key | Iterators
  • 11.) C++ Map : Operator []
  • 12.) Erase by Value or callback
  • 13.) copy all Values from a Map to vector

STL Multimap

  • MultiMap Example and Tutorial
  • multimap::equals_range – Tutorial

STL Algorithms

  • std::sort Tutorial & Example
  • std::unique Tutorial & Example
  • 1.) Using std::find & std::find_if with User Defined Classes
  • 2.) Iterating over a range of User Defined objects and calling member function using std::for_each

Terms and Conditions

  • Terms and Conditions Policy
Copyright ©2018. thisPointer.com